Regularity and Context-Freeness over Word Rewriting Systems
نویسندگان
چکیده
We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivation relation of a system R′ ∪ D, where R′ is a strict sub-system of R and D is the Dyck rewriting system. From this decomposition, we deduce that the system R (resp. R) preserves regular (resp. context-free) languages whenever R ′ ∪ D does. From this we can deduce regularity and context-freeness preservation properties for a generalization of tagged bifix systems.
منابع مشابه
Reachability over word rewriting systems
Word rewriting systems have been studied over the last century under several aspects. In the beginning, they were considered as a framework for the representation of computation processes and as a tool for generating formal languages. In more recent years, they have also been investigated as a mechanism to represent infinite graphs by a finite formalism. This thesis has its main focus in the la...
متن کاملOn Regularity of Acts
In this article we give a characterization of monoids for which torsion freeness, ((principal) weak, strong) flatness, equalizer flatness or Condition (E) of finitely generated and (mono) cyclic acts and Condition (P) of finitely generated and cyclic acts implies regularity. A characterization of monoids for which all (finitely generated, (mono) cyclic acts are regular will be given too. We als...
متن کاملOn Bifix Systems and Generalizations
Motivated by problems in infinite-state verification, we study word rewriting systems that extend mixed prefix/suffix rewriting (short: bifix rewriting). We introduce several types of infix rewriting where infix replacements are subject to the condition that they have to occur next to tag symbols within a given word. Bifix rewriting is covered by the case where tags occur only as end markers. W...
متن کاملOn the U-WPF Acts over Monoids
Valdis Laan in [5] introduced an extension of strong flatness which is called weak pullback flatness. In this paper we introduce a new property of acts over monoids, called U-WPF which is an extension of weak pullback flatness and give a classification of monoids by this property of their acts and also a classification of monoids when this property of acts implies others. We also show that regu...
متن کاملInnnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کامل